Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
نویسندگان
چکیده
We consider the problem Maximum Leaf Spanning Tree (MLST) on digraphs, which is defined as follows. Given a digraph G, find a directed spanning tree of G that maximizes the number of leaves. MLST is NP-hard. Existing approximation algorithms for MLST have ratios of O( √ OPT) and 92. We focus on the special case of acyclic digraphs and propose two lineartime approximation algorithms; one with ratio 4 that uses a result of Daligault and Thomassé and one with ratio 2 based on a 3-approximation algorithm of Lu and Ravi for the undirected version of the problem. We complement these positive results by observing that MLST is MaxSNPhard on acyclic digraphs. Hence, this special case does not admit a PTAS (unless P = NP).
منابع مشابه
Parameterized Algorithms for Directed Maximum Leaf Problems
We prove that finding a rooted subtree with at least k leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family L that includes all strong and acyclic digraphs. This settles completely an open question of Fellows and solves another one for digraphs in L. We also prove the following combin...
متن کاملFPT Algorithms and Kernels for the Directed $k$-Leaf Problem
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero are leaves. In the Directed Max Leaf Problem, we wish to find the maximum number of leaves in an out-branching of a given digraph D (or, to report that D has no out-branching). In the Directed k-Leaf Problem, we are give...
متن کاملOn the Directed Degree-Preserving Spanning Tree Problem
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning out-tree with at most k vertices of reduced out-degree. This problem is a directed analog of the wellstudied Minimum-Vertex Feedback Edge Set problem. We show that this problem is fixed-parameter tractable and admits a...
متن کاملar X iv : 0 80 3 . 07 01 v 1 [ cs . D S ] 5 M ar 2 00 8 Spanning directed trees with many leaves ⋆
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we obtain two combinatorial results on the number of leaves in out-branchings. We show that – every strongly connected n-vertex digraph D with minimum indegree at least 3 has an out-branching with at least (n/4) −...
متن کاملSpanning directed trees with many leaves
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we obtain two combinatorial results on the number of leaves in out-branchings. We show that – every strongly connected n-vertex digraph D with minimum indegree at least 3 has an out-branching with at least (n/4) −...
متن کامل